Domination analysis of combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
Domination analysis of combinatorial optimization problems
We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results proved already in the 1970’s that min TSP (both symmetric and asymmetric versions) is DOM-easy. We prove that several CO problems are DOM-easy including weighted max k-SAT and max cut. W...
متن کاملDomination Analysis of Combinatorial Optimization Algorithms and Problems
We provide an overview of an emerging area of domination analysis (DA) of combinatorial optimization algorithms and problems. We consider DA theory and its relevance to computational practice.
متن کاملDomination Analysis in Combinatorial Optimization
BackgroundGame Theory Interpretation MethodsRandomizationFunctional Lagrange Multipliers ConclusionsReferences
متن کاملDomination Analysis in Combinatorial Optimization
Exact algorithms allow one to find optimal solutions to NP-hard combinatorial optimization (CO) problems. Many research papers report on solving large instances of some NPhard problems (see, e.g., [25, 27]). The running time of exact algorithms is often very high for large instances (many hours or even days), and very large instances remain beyond the capabilities of exact algorithms. Even for ...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00359-7